Drawing Arrangement Graphs in Small Grids, or How to Play Planarity
نویسنده
چکیده
We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n). No known input causes our algorithm to use area Ω(n ) for any > 0; finding such an input would represent significant progress on the famous k-set problem from discrete geometry. Drawing line arrangement graphs is the main task in the Planarity puzzle.
منابع مشابه
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a clustering which satisfies the conditions for compound-planarity (c-planarity). Using the clustering, we obtain a representation of the graph as a collection of O(logn) layers, where each succeeding layer represents t...
متن کاملAdvances in C-Planarity Testing of Clustered Graphs
A clustered graph C = (G; T ) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G = (V;E). Each vertex c in T corresponds to a subset of the vertices of the graph called \cluster". c-planarity is a natural extension of graph planarity for clustered graphs, and plays an important role in automatic graph drawing. The complexity status of ...
متن کاملBeyond-Planarity: Density Results for Bipartite Graphs
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani [14]) for extremal problems on geometric graphs, but is also related to graph drawing problems ...
متن کاملThe Utility of Untangling
In this note we show how techniques developed for untangling planar graphs by Bose et al.[Discrete & Computational Geometry 42(4): 570-585 (2009)] and Goaoc et al.[Discrete & Computational Geometry 42(4): 542-569 (2009)] imply new results about some recent graph drawing models. These include column planarity, universal point subsets, and partial simultaneous geometric embeddings (with or withou...
متن کاملClustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [6,10–16] and clustered graphs [5,7]. In k-level graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 18 شماره
صفحات -
تاریخ انتشار 2013